Loops and trees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Loops on Surfaces, Feynman Diagrams, and Trees

We relate the author’s Lie cobracket in the module additively generated by loops on a surface with the Connes-Kreimer Lie bracket in the module additively generated by trees.

متن کامل

From Trees to Loops and Back

We argue that generic one-loop scattering amplitudes in supersymmetric Yang-Mills theories can be computed equivalently with MHV diagrams or with Feynman diagrams. We first present a general proof of the covariance of one-loop non-MHV amplitudes obtained from MHV diagrams. This proof relies only on the local character in Minkowski space of MHV vertices and on an application of the Feynman Tree ...

متن کامل

Chip-Firing on Trees of Loops

Cools, Draisma, Payne, and Robeva proved that generic metric graphs that are “paths of loops” are Brill-Noether general. We show that Brill-Noether generality does not hold for “trees of loops”: the only trees of loops that are Brill-Noether general are paths of loops. We study various notions of generality and examine which of these graphs satisfy them.

متن کامل

From loops to trees by-passing Feynman’s theorem

We derive a duality relation between one-loop integrals and phase-space integrals emerging from them through single cuts. The duality relation is realized by a modification of the customary +i0 prescription of the Feynman propagators. The new prescription regularizing the propagators, which we write in a Lorentz covariant form, compensates for the absence of multiplecut contributions that appea...

متن کامل

Circuits in random graphs: from local trees to global loops

We compute the number of circuits and of loops with multiple crossings in random regular graphs. We discuss the importance of this issue for the validity of the cavity approach. On the one side we obtain analytic results for the infinite volume limit in agreement with existing exact results. On the other side we implement a counting algorithm, enumerate circuits at finite N and draw some genera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of High Energy Physics

سال: 2011

ISSN: 1029-8479

DOI: 10.1007/jhep05(2011)080